A STUDY OF DECISION TREE ALGORITHMS FOR CONTINUOUS ATTRIBUTES
نویسندگان
چکیده
منابع مشابه
A Decision Tree for Technology Selection of Nitrogen Production Plants
Nitrogen is produced mainly from its most abundant source, the air, using three processes: membrane, pressure swing adsorption (PSA) and cryogenic. The most common method for evaluating a process is using the selection diagrams based on feasibility studies. Since the selection diagrams are presented by different companies, they are biased, and provide unsimilar and even controversial results. I...
متن کاملProviding a Model for Cost Estimation of Hospital Information System Software Design Using Continuous Decision Tree Algorithm
Introduction: The cost estimation of a hospital information system software refers to estimating the cost and time required to develop the hospital information system software prior to the start of the project, which will continue until the end of production and development of the system. Estimating the cost of software to produce hospital information system is one of the major concerns of proj...
متن کاملProviding a Model for Cost Estimation of Hospital Information System Software Design Using Continuous Decision Tree Algorithm
Introduction: The cost estimation of a hospital information system software refers to estimating the cost and time required to develop the hospital information system software prior to the start of the project, which will continue until the end of production and development of the system. Estimating the cost of software to produce hospital information system is one of the major concerns of proj...
متن کاملT3C: improving a decision tree classification algorithm's interval splits on continuous attributes
This paper proposes, describes and evaluates T3C, a classification algorithm that builds decision trees of depth at most three, and results in high accuracy whilst keeping the size of the tree reasonably small. T3C is an improvement over algorithm T3 in the way it performs splits on continuous attributes. When run against publicly available data sets, T3C achieved lower generalisation error tha...
متن کاملTree-Based Kernel for Graphs With Continuous Attributes.
The availability of graph data with node attributes that can be either discrete or real-valued is constantly increasing. While existing Kernel methods are effective techniques for dealing with graphs having discrete node labels, their adaptation to nondiscrete or continuous node attributes has been limited, mainly for computational issues. Recently, a few kernels especially tailored for this do...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Environment. Technology. Resources. Proceedings of the International Scientific and Practical Conference
سال: 2001
ISSN: 2256-070X,1691-5402
DOI: 10.17770/etr2001vol1.1922